翻訳と辞書 Words near each other ・ Bijayalpura ・ Bijayapur ・ Bijaći ・ Bijača ・ Bijbania ・ Bijbaniya ・ Bijbehara ・ Bijbehara Massacre ・ Bijbehara railway station ・ Bijbels Museum ・ Bijdeh-ye Now ・ Bijdragen tot de Geschiedenis ・ Bijdragen tot de Taal-, Land- en Volkenkunde ・ Bijection ・ Bijection, injection and surjection ・ Bijective numeration ・ Bijective proof ・ Bijedići ・ Bijegan ・ Bijela ・ Bijela (Brčko) ・ Bijela (Konjic) ・ Bijela (Višegrad) ・ Bijela Crkva ・ Bijela gora ・ Bijela Monastery ・ Bijela Ploča ・ Bijela Rudina ・ Bijela Stijena ・ Bijela Tabija Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Bijective numeration ： ウィキペディア英語版 Bijective numeration Bijective numeration is any numeral system in which every non-negative integer can be represented in exactly one way using a finite string of digits. The name derives from this bijection (one-to-one correspondence) between the set of non-negative integers and the set of finite strings using a finite set of symbols (the "digits"). Most ordinary numeral systems, such as the common decimal system, are not bijective because more than one string of digits can represent the same positive integer. In particular, adding leading zeroes does not change the value represented, so "1", "01" and "001" all represent the number one. Even though only the first is usual, the fact that the others are possible means that decimal is not bijective. However, unary, with only one digit, ''is'' bijective. A bijective base-''k'' numeration is a bijective positional notation. It uses a string of digits from the set (where ''k'' ≥ 1) to encode each positive integer; a digit's position in the string defines its value as a multiple of a power of ''k''. calls this notation ''k''-adic, but it should not be confused with the ''p''-adic numbers: bijective numerals are a system for representing ordinary integers by finite strings of nonzero digits, whereas the ''p''-adic numbers are a system of mathematical values that contain the integers as a subset and may need infinite sequences of digits in any numerical representation. ==Definition== The base-''k'' bijective numeration system uses the digit-set (''k'' ≥ 1) to uniquely represent every non-negative integer, as follows: * The integer zero is represented by the ''empty string''. * The integer represented by the nonempty digit-string :: :is ::. * The digit-string representing the integer ''m'' > 0 is :: :where ::$$ \begin a_0 & = & m - q_0 k , & & q_0 & = & f\left(\frac m k \right) & \\ a_1 & = & q_0 - q_1 k , & & q_1 & = & f\left(\frac k \right) & \\ a_2 & = & q_1 - q_2 k , & & q_2 & = & f\left(\frac k \right) & \\ & \vdots & & & & \vdots & & \\ a_n & = & q_ - 0 k , & & q_n & = & f\left(\frac :and ::$f(x)\; =\; \backslash lceil\; x\; \backslash rceil\; -\; 1$, :$\backslash lceil\; x\; \backslash rceil$ being the least integer not less than ''x'' (the ceiling function). ==Properties of bijective base-''k'' numerals== For a given base ''k'' ≥ 1, * there are exactly ''k''''n'' bijective base-''k'' numerals of length ''n'' ≥ 0. * if ''k'' > 1, the number of digits in the bijective base-''k'' numeral representing a nonnegative integer ''n'' is $\backslash lfloor\; \backslash log\_k\; (n+1)\; +\backslash log\_k(k\; -\; 1)\; \backslash rfloor$, in contrast to $\backslash lfloor\; \backslash log\_k\; n\backslash rfloor\; +1\; \backslash \; (n\; >\; 0)$ for ordinary base-k numerals; if ''k'' = 1 (i.e., unary), then the number of digits is just ''n''; * a list of bijective base-''k'' numerals, in natural order of the integers represented, is automatically in shortlex order (shortest first, lexicographical within each length). Thus, using λ to denote the empty string, the base 1, 2, 3, and 10 numerals are as follows (where the ordinary binary and decimal representations are listed for comparison): 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Bijective numeration」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.